Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control

Computation of (approximate) polynomials common factors is an important problem in several fields science, like control theory and signal processing. While the has been widely studied for scalar polynomials, scientific literature framework matrix seems to be limited exact greatest divisors computation. In this paper, we generalize two algorithms from polynomials. The first one fast simple. second more accurate but computationally expensive. We test performances observe similar behavior case. Finally describe application multi-input multi-output linear time-invariant dynamical systems.